Exact solution of site and bond percolation on small-world networks.

نویسندگان

  • C Moore
  • M E Newman
چکیده

We study percolation on small-world networks, which has been proposed as a simple model of the propagation of disease. The occupation probabilities of sites and bonds correspond to the susceptibility of individuals to the disease, and the transmissibility of the disease respectively. We give an exact solution of the model for both site and bond percolation, including the position of the percolation transition at which epidemic behavior sets in, the values of the critical exponents governing this transition, the mean and variance of the distribution of cluster sizes (disease outbreaks) below the transition, and the size of the giant component (epidemic) above the transition.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Epidemics and percolation in small-world networks.

We study some simple models of disease transmission on small-world networks, in which either the probability of infection by a disease or the probability of its transmission is varied, or both. The resulting models display epidemic behavior when the infection or transmission probability rises above the threshold for site or bond percolation on the network, and we give exact solutions for the po...

متن کامل

Patchy percolation on a hierarchical network with small-world bonds.

The bond-percolation properties of the recently introduced Hanoi networks are analyzed with the renormalization group. Unlike scale-free networks, these networks are meant to provide an analytically tractable interpolation between finite-dimensional, lattice-based models and their mean-field limits. In percolation, the hierarchical small-world bonds in the Hanoi networks impose order by uniting...

متن کامل

Network robustness and fragility: percolation on random graphs.

Recent work on the Internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes or links. Such deletions include, for example, the failure of Internet routers or power transmission lines. Percolation models on random graphs provide a simple representation of this process but have typically been limited to gra...

متن کامل

The Unreasonable Effectiveness of Tree-Based Theory for Bond Percolation on Networks with Clustering

We demonstrate that a tree-based theory for bond percolation yields extremely accurate results for several networks with high levels of clustering. We find that such a theory works well as long as the mean intervertex distance l is sufficiently small—i.e., as long as it is close to the value of l in a random network with negligible clustering and the same degree-degree correlations. We confirm ...

متن کامل

Spectral estimation of the percolation transition in clustered networks

There have been several spectral bounds for the percolation transition in networks, using spectrum of matrices associated with the network such as the adjacency matrix and the nonbacktracking matrix. However, they are far from being tight when the network is sparse and displays clustering or transitivity, which is represented by existence of short loops, e.g., triangles. In this paper, for the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics

دوره 62 5 Pt B  شماره 

صفحات  -

تاریخ انتشار 2000